Strongly Even-Cycle Decomposable Graphs
نویسندگان
چکیده
منابع مشابه
Strongly even cycle decomposable graphs
We introduce the notion of an Eulerian graph being strongly evencycle decomposable, and note that a few basic classes have this property. Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable. As an application, our composition operations easily imply that all Euleria...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملThe Even Cycle Problem for Directed Graphs
If each arc in a strongly connected directed graph of minimum in-degree and outdegree at least 3 is assigned a weight 0 or 1, then the resultingweighted directed graph has a directed cycle of even total weight. This provesa conjecture made by L. Lovasz in 1975 and has applications to colour-criticalhypergraphs, sign-nonsingular matrices, and permanents of matrices. MATHEMATICAL ...
متن کاملEven cycle decompositions of 4-regular graphs and line graphs
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...
متن کاملOn arbitraly vertex decomposable unicyclic graphs with dominating cycle
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that ∑k i=1 ni = n, there exists a partition (V1, . . . , Vk) of vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2016
ISSN: 0364-9024
DOI: 10.1002/jgt.22018